Robert Bresson: Depth Behind Simplicity

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inherent structure length in metallic glasses: simplicity behind complexity

One of the central themes in materials science is the structure-property relationship. In conventional crystalline metals, their mechanical behaviour is often dictated by well-defined structural defects such as dislocations, impurities, and twins. However, the structure-property relationship in amorphous alloys is far from being understood, due to great difficulties in characterizing and descri...

متن کامل

Security Extension for Bresson-Chevassut-Pointcheval’s model

The Bresson-Chevassut-Pointcheval (BCP) model is a formalism for the analysis of authenticated group key exchange protocols. Also there are some desired security goals for a practical group key exchange protocol, which are necessary in achieving resistance to active attacks mounted by an increasingly powerful adversary. However, whether a proved secure protocol in the BCP model can meet these s...

متن کامل

Simplicity.

Perhaps the most famous equation in science is E = mc2; it also represents one of the best-known scientific insights. But why does Einstein’s equation about the conservation of energy enjoy such popularity? Is it because it is easily and instinctively understood, or because it is widely taught in schools? I doubt that either explanation is true; rather, its appeal is its elegant simplicity with...

متن کامل

Attacks on Bresson-Chevassut-Essiari-Pointcheval’s Group Key Agreement Scheme⋆

In this paper, we show that Bresson-Chevassut-Essiari-Pointcheval’s group key agreement scheme does not meet the main security properties: implicit key authentication, forward secrecy, and known key security. Also, we propose an improved version which fixes the security flaws found in the scheme.

متن کامل

Eeciency and Simplicity in Self-stabilizing Distributed Depth-first Token Circulation Algorithms

The self-stabilizing distributed depth-rst token circulation algorithms have many applications in distributed systems. The solution to this problem can be used to solve the mutual exclusion, spanning tree construction, synchronization, and many others. In this thesis, we propose several depth-rst token circulation algorithms for trees and arbitrary networks. The algorithms do not use the proces...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kinema: A Journal for Film and Audiovisual Media

سال: 2000

ISSN: 2562-5764,1192-6252

DOI: 10.15353/kinema.vi.919